A Uniied Approach to Evaluation Algorithms for Multivariate Polynomials
نویسندگان
چکیده
abstract We present a uniied framework for most of the known and a few new evaluation algorithms for multivariate polynomials expressed in a wide variety of bases including the B ezier, multinomial (or Taylor), Lagrange and Newton bases. This uniication is achieved by considering evaluation algorithms for multivariate polynomials expressed in terms of L-bases, a class of bases that include the B ezier, multinomial, and a rich subclass of Lagrange and Newton bases. All of the known evaluation algorithms can be generated either by considering recursive evaluation algorithms for L-bases or by examining change of basis algorithms for L-bases.
منابع مشابه
A Uniied Approach to Hgcd Algorithms for Polynomials and Integers
We present a uniied framework for the asymptotically fast Half-GCD (HGCD) algorithms, based on properties of the norm. Two other beneets of our approach are (a) a simpliied correctness proof of the polynomial HGCD algorithm and (b) the rst explicit integer HGCD algorithm. The integer HGCD algorithm turns out to be rather intricate.
متن کاملA unified approach to evaluation algorithms for multivariate polynomials
We present a unified framework for most of the known and a few new evaluation algorithms for multivariate polynomials expressed in a wide variety of bases including the Bernstein-Bézier, multinomial (or Taylor), Lagrange and Newton bases. This unification is achieved by considering evaluation algorithms for multivariate polynomials expressed in terms of Lbases, a class of bases that include the...
متن کاملA Clustering Based Location-allocation Problem Considering Transportation Costs and Statistical Properties (RESEARCH NOTE)
Cluster analysis is a useful technique in multivariate statistical analysis. Different types of hierarchical cluster analysis and K-means have been used for data analysis in previous studies. However, the K-means algorithm can be improved using some metaheuristics algorithms. In this study, we propose simulated annealing based algorithm for K-means in the clustering analysis which we refer it a...
متن کاملTwo Families of Algorithms for Symbolic Polynomials
We consider multivariate polynomials with exponents that are themselves integer-valued multivariate polynomials, and we present algorithms to compute their GCD and factorization. The algorithms fall into two families: algebraic extension methods and projection methods. The first family of algorithms uses the algebraic independence of x, x, x 2 , x, etc, to solve related problems with more indet...
متن کاملSimple Learning Algorithms for Decision Trees and Multivariate Polynomials
In this paper we develop a new approach for learning decision trees and multivariate polynomials via interpolation of multivariate polynomials. This new approach yields simple learning algorithms for multivariate polynomials and decision trees over nite elds under any constant bounded product distribution. The output hypothesis is a (single) multivariate polynomial that is an-approximation of t...
متن کامل